Infinite-Time Turing Machines and Borel Reducibility
نویسنده
چکیده
In this document I will outline a couple of recent developments, due to Joel Hamkins, Philip Welch and myself, in the theory of infinite-time Turing machines. These results were obtained with the idea of extending the scope of the study of Borel equivalence relations, an area of descriptive set theory. I will introduce the most basic aspects of Borel equivalence relations, and show how infinite-time computation may provide insight into this area.
منابع مشابه
Infinite Computations with Random Oracles
We consider the following problem for various infinite time machines. If a real is computable relative to large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent from ZFC for ordinal time machines (OTMs) with and without ordinal parameters and give a positive answer...
متن کاملThe effective theory of Borel equivalence relations
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-Kechris-Louveau ([5]) show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on ω is above equality on P(ω), the power set of ω, and any Borel equivalence relation strictly ...
متن کاملComputable Reducibility for Cantor Space
We examine various versions of Borel reducibility on equivalence relations on the Cantor space 2ω , using reductions given by Turing functionals on the inputs A ∈ 2ω . In some versions, we vary the number of jumps of A which the functional is allowed to use. In others, we do not require the reduction to succeed for all elements of the Cantor space at once, but only when applied to arbitrary fin...
متن کاملInfinite time recognizability from generic oracles and the recognizable jump operator
By a theorem of Sacks, if a real x is recursive relative to all elements of a set of positive Lebesgue measure, x is recursive. This statement, and the analogous statement for non-meagerness instead of positive Lebesgue measure, have been shown to carry over to many models of transfinite computations in [11]. Here, we start exploring another analogue concerning recognizability rather than compu...
متن کاملOn truth-table reducibility to SAT and the difference hierarchy over NP
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as log space truth-table reducibility via Boolean formulas to SAT and the same as log space Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. Finally, we show that the infinite difference hierarc...
متن کامل